Xodx - A node for the Distributed Semantic Social Network

نویسندگان

  • Natanael Arndt
  • Sebastian Tramp
چکیده

The world wide web (WWW) is not anymore just an information retrieval system [1] but rather an interactive communication medium. Within the last decade online social networks have evolved and constantly increased in popularity. The currently most used online social network services, according to their estimated monthly active users1, are Facebook (1.27 billion, facebook.com), Google Plus (541million, plus.google.com) and Twitter (283million, twitter.com). Compared to the estimated total users of the WWW of 2.93billion, over 40% of the users of the WWW are actively using Facebook. This concentration on some single services contradicts the actual organisation of the WWW and the whole Internet as a network of decentrally organised and interconnected computer nodes. This situation bears risks regarding the privacy, data security, data ownership, reliability of the services and freedom of communication. By building up a distributed online social network with multiple interconnected services this risks can be minimised and a much more flexibly expendable network is created. We present Xodx (http://aksw.org/Projects/Xodx, includes a live demo) an implementation of a node for the Distributed Semantic Social Network (DSSN). The DSSN is a general architecture for building an online social network using Semantic Web standards and additional protocols for real-time communication. Xodx provides functionality for publishing and editing personal profiles, adding friends to the friend list, sending and receiving friendship requests, publishing posts and following other users activities across distributed nodes.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hybrid Regenerating Codes for Distributed Storage Systems

Distributed storage systems are mainly justified due to their ability to store data reliably over some unreliable nodes such that the system can have long term durability. Recently, regenerating codes are proposed to make a balance between the repair bandwidth and the storage capacity per node. This is achieved through using the notion of network coding approach. In this paper, a new variation ...

متن کامل

Distributed and Cooperative Compressive Sensing Recovery Algorithm for Wireless Sensor Networks with Bi-directional Incremental Topology

Recently, the problem of compressive sensing (CS) has attracted lots of attention in the area of signal processing. So, much of the research in this field is being carried out in this issue. One of the applications where CS could be used is wireless sensor networks (WSNs). The structure of WSNs consists of many low power wireless sensors. This requires that any improved algorithm for this appli...

متن کامل

A New Method of Distribution Marginal Price Calculation in Distribution Networks by Considering the Effect of Distributed Generations Location on Network Loss

The determination of practical and coherent policy to pin down the price in restructured distribution networks should be considered as a momentous topic. The present paper introduces a new method of distribution marginal price (DMP) calculation. The main aim of this paper is to evaluate the DMP for both producers and consumers separately. For this purpose, the first part of the procedure emphas...

متن کامل

DALD:-Distributed-Asynchronous-Local-Decontamination Algorithm in Arbitrary Graphs

Network environments always can be invaded by intruder agents. In networks where nodes are performing some computations, intruder agents might contaminate some nodes. Therefore, problem of decontaminating a network infected by intruder agents is one of the major problems in these networks. In this paper, we present a distributed asynchronous local algorithm for decontaminating a network. In mos...

متن کامل

Exploiting Social Property for Improving Distributed Semantic Search

To locate desirable Semantic Web data in a distributed network, the discovering mechanism has to be not only semantically rich, in order to cope with complex queries, but also scalable to handle large numbers of information sources. In this paper, we propose a novel scheme that exploits the social property of humans, such as natural grouping and peer recommendation between people with common in...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014